Sparse Isotropic Hashing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isotropic Hashing

Most existing hashing methods adopt some projection functions to project the original data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by thresholding. Typically, the variances of different projected dimensions are different for existing projection functions such as principal component analysis (PCA). Using the same...

متن کامل

Implicit Sparse Code Hashing

We address the problem of converting large-scale highdimensional image data into binary codes so that approximate nearest-neighbor search over them can be efficiently performed. Different from most of the existing unsupervised approaches for yielding binary codes, our method is based on a dimensionality-reduction criterion that its resulting mapping is designed to preserve the image relationshi...

متن کامل

Sparse similarity-preserving hashing

In recent years, a lot of attention has been devoted to efficient nearest neighbor search by means of similarity-preserving hashing. One of the plights of existing hashing techniques is the intrinsic trade-off between performance and computational complexity: while longer hash codes allow for lower false positive rates, it is very difficult to increase the embedding dimensionality without incur...

متن کامل

Efficient Assembly of Sparse Matrices Using Hashing

In certain applications the non-zero elements of large sparse matrices are formed by adding several smaller contributions in random order before the final values of the elements are known. For some sparse matrix representations this procedure is laborious. We present an efficient method for assembling large irregular sparse matrices where the nonzero elements have to be assembled by adding toge...

متن کامل

Homomorphic Hashing for Sparse Coefficient Extraction

1 Helsinki Institute for Information Technology, Department of Computer Science, Aalto University, Finland. [email protected]. Supported by the Academy of Finland, Grants 252083 and 256287. 2 Helsinki Institute for Information Technology, Department of Computer Science University of Helsinki, Finland. [email protected] Supported by the Academy of Finland, Grant 125637. 3 Utrecht Univ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IPSJ Transactions on Computer Vision and Applications

سال: 2013

ISSN: 1882-6695

DOI: 10.2197/ipsjtcva.5.40